Some Bounds for the Ramsey-Paris-Harrington Numbers
نویسندگان
چکیده
It has recently been discovered that a certain variant of Ramsey's theorem cannot be proved in first-order Peano arithmetic although it is in fact a true theorem. In this paper we give some bounds for the "Ramsey-Paris-Harrington numbers" associated with this variant of Ramsey's theorem, involving coloring of pairs . In the course of the investigation we also study certain weaker and stronger partition relations .
منابع مشابه
Zarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملSharp Phase Transition Thresholds for the Paris Harrington Ramsey Numbers for a Fixed Dimension
This article is concerned with investigations on a phase transition which is related to the (finite) Ramsey theorem and the Paris-Harrington theorem. For a given number-theoretic function g, let Rd c (g)(k) be the least natural number R such that for all colourings P of the d-element subsets of {0, . . . , R− 1} with at most c colours there exists a subset H of {0, . . . , R− 1} such that P has...
متن کاملUpper Bounds for Positional Paris-Harrington Games
We give upper bounds for a positional game — in the sense of Beck — based on the Paris-Harrington principle for bi-colorings of graphs and uniform hypergraphs of arbitrary dimension. The bounds show a striking difference with respect to the bounds of the combinatorial principle itself. Our results confirm a phenomenon already observed by Beck and others: the upper bounds for the game version of...
متن کاملThe Paris-Harrington Theorem
In Ramsey theory, very large numbers and fast-growing functions are more of a rule than an exception. The classical Ramsey numbers R(n,m) are known to be of exponential size: the original proof directly gives the upper bound R(n,m) ≤ ( m+n−2 n−1 ) , and an exponential lower bound is also known. For the van der Waerden numbers, the original proof produced upper bounds that were not even primitiv...
متن کاملIndependence of Ramsey theorem variants using ε0, Draft
We discuss the Vnite adjacent Ramsey theorem, one of the most recent independence results in Peano Arithmetic, and show some fascinating connections with two of the earliest examples of natural unprovability: the Paris–Kirby Hydra battles and the Paris– Harrington theorem. The proofs in this paper, together with the proofs for Goodstein sequences from [4], are particularly well suited for prese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 30 شماره
صفحات -
تاریخ انتشار 1981